Newton’s Iteration with a Conjugate Gradient Based Decomposition Method for an Elliptic Pde with a Nonlinear Boundary Condition
نویسنده
چکیده
Newton’s iteration is studied for the numerical solution of an elliptic PDE with nonlinear boundary conditions. At each iteration of Newton’s method, a conjugate gradient based decomposition method is applied to the matrix of the linearized system. The decomposition is such that all the remaining linear systems have the same constant matrix. Numerical results confirm the savings with respect to the computational cost, compared with the classical Newton method with factorization at each step.
منابع مشابه
Free and constrained equilibrium states in a variational problem on a surface
We study the equilibrium states for an energy functional with a parametric force field on a region of a surface. Consideration of free equilibrium states is based on Lyusternik - Schnirelman's and Skrypnik's variational methods. Consideration of equilibrium states under a constraint of geometrical character is based on an analog of Skrypnik's method, described in [P. Vyridis, {it Bifurcation in...
متن کاملOn Schwarz's domain decomposition methods for elliptic boundary value problems
We study the additive and multiplicative Schwarz domain decomposition methods for elliptic boundary value problem of order 2r based on an appropriate spline space of smoothness r ? 1. The nite element method reduces an elliptic boundary value problem to a linear system of equations. It is well known that as the number of triangles in the underlying triangulation is increased, which is indispens...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملLocal Inexact Newton Multilevel FEM for Nonlinear Elliptic Problems
The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex functionals. Uniform ellipticity of the underlying PDE shows up as strict convexity of the arising nonlinear functional. The paper analyzes computational variants of Newton’s method for convex optimization in an affine conjugate setting, which reflects the appropriate affine transformation behavi...
متن کامل